A note on Liu-Iwamura's dependent-chance programming
نویسندگان
چکیده
Sometimes a complex stochastic decision system undertakes multiple tasks called events, and the decision-maker wishes to maximize the chance functions which are defined as the probabilities of satisfying these events. Originally introduced by Liu and Iwamura [6], dependent-chance programming is aimed at maximizing some chance functions of events in an uncertain environment. In this work we show that the original dependent chance-programming framework needs to be extended in order to capture an exact reliability measure for a given plan.
منابع مشابه
SOME PROPERTIES FOR FUZZY CHANCE CONSTRAINED PROGRAMMING
Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...
متن کاملA SHORT NOTE ON THE RELATIONSHIP BETWEEN GOAL PROGRAMMING AND FUZZY PROGRAMMING FOR VECTORMAXIMUM PROBLEMS
A theorem was recently introduced to establish a relationship betweengoal programming and fuzzy programming for vectormaximum problems.In this short note it is shown that the relationship does not exist underall circumstances. The necessary correction is proposed.
متن کاملEfficiency of Anti-Hourglassing Approaches in Finite Element Method (TECHNICAL NOTE)
one of the simplest numerical integration method which provides a large saving in computational efforts, is the well known one-point Gauss quadrature which is widely used for 4 nodes quadrilateral elements. On the other hand, the biggest disadvantage to one-point integration is the need to control the zero energy modes, called hourglassing modes, which arise. The efficiency of four different an...
متن کاملCREDIBILITY-BASED FUZZY PROGRAMMING MODELS TO SOLVE THE BUDGET-CONSTRAINED FLEXIBLE FLOW LINE PROBLEM
This paper addresses a new version of the exible ow line prob- lem, i.e., the budget constrained one, in order to determine the required num- ber of processors at each station along with the selection of the most eco- nomical process routes for products. Since a number of parameters, such as due dates, the amount of available budgets and the cost of opting particular routes, are imprecise (fuzz...
متن کاملORE extraction and blending optimization model in poly- metallic open PIT mines by chance constrained one-sided goal programming
Determination a sequence of extracting ore is one of the most important problems in mine annual production scheduling. Production scheduling affects mining performance especially in a poly-metallic open pit mine with considering the imposed operational and physical constraints mandated by high levels of reliability in relation to the obtained actual results. One of the important operational con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 198 شماره
صفحات -
تاریخ انتشار 2009